Master ’ s Thesis Proposal , 20 credits : ScaLAPACK - style algorithms for Periodic Matrix Equations

ثبت نشده
چکیده

1 Motivation This Master's Thesis project considers software for solving periodic Sylvester-type matrix equations. Recently, the ScaLAPACK-style library SCASY was completed. SCASY is a parallel HPC software library that solves for 42 sign and transpose variant of 8 common standard and generalized Sylvester-type matrix equations (see Table 1) which builds on the Table 1: The Sylvester-type matrix equations considered in the SCASY library. CT and DT denote the continuous-time and discrete-time variants, respectively. Name Matrix Equation Standard Sylvester (CT) AX − XB = C Standard Lyapunov (CT) AX + XA T = C Standard Sylvester (DT) AXB T − X = C Standard Lyapunov (DT) AXA T − X = C Generalized Coupled Sylvester (AX − Y B, DX − Y E) = (C, F) Generalized Sylvester AXB T − CXD T = E Generalized Lyapunov (CT) AXE T + EXA T = C Generalized Lyapunov (DT) AXA T − EXE T = C An example of a periodic Sylvester-type matrix equation is the periodic Sylvester equation (PSE): A k X k − X k⊕1 B k = C k , R m×n and a ⊕ b = a + b mod K. Serial algorithms for solving this equations was developed in, e.g., [7]. Periodic counterparts of many of the equations listed in Table 1 can be formulated, see, e.g., [13, 15, 16]. Generalized coupled matrix equations also arises in the context of computing periodic deflating subspaces with specified eigenvalues, see [8]. In the project, we would like to port the algorithms in SCASY to the periodic Sylvester-type matrix equations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Contributions to Parallel Algorithms for Sylvester-type Matrix Equations and Periodic Eigenvalue Reordering in Cyclic Matrix Products

This Licentiate Thesis contains contributions in two different subfields of Computing Science: parallel ScaLAPACK-style algorithms for Sylvester-type matrix equations and periodic eigenvalue reordering in a cyclic product of matrices. Sylvester-type matrix equations, like the continuous-time Sylvester equation AX −XB = C, where A of size m×m, B of size n×n and C of size m×n are general matrices...

متن کامل

Parallel ScaLAPACK-Style Algorithms for Solving Continuous-Time Sylvester Matrix Equations

An implementation of a parallel ScaLAPACK-style solver for the general Sylvester equation, op(A)X−Xop(B) = C, where op(A) denotes A or its transpose A , is presented. The parallel algorithm is based on explicit blocking of the Bartels-Stewart method. An initial transformation of the coefficient matrices A and B to Schur form leads to a reduced triangular matrix equation. We use different matrix...

متن کامل

Proposal for Master Thesis in Software Engineering Base information

Title: A Systematic and Lightweight Method to identify dependencies between requirements. Student 1 suitability Software engineering course credits completed at BTH (total): 30 (BTH) + 60 (UPM) ECTS credit points Student 2 suitability Software engineering course credits completed at BTH (total): 30 (BTH) + 60 (UPM) ECTS credit points

متن کامل

Evaluating Parallel Algorithms for Solving Sylvester-Type Matrix Equations: Direct Transformation-Based Versus Iterative Matrix-Sign-Function-Based Methods

Recent ScaLAPACK-style implementations of the BartelsStewart method and the iterative matrix-sign-function-based method for solving continuous-time Sylvester matrix equations are evaluated with respect to generality of use, execution time and accuracy of computed results. The test problems include well-conditioned as well as illconditioned Sylvester equations. A method is considered more genera...

متن کامل

Parallel Solvers for Sylvester-Type Matrix Equations with Applications in Condition Estimation, Part II: The SCASY Software Library

We continue our presentation of parallel ScaLAPACK-style algorithms for solving Sylvester-type matrix equations. In Part II, we present SCASY, a state-of-the-art HPC software library for solving 44 sign and transpose variants of eight common standard and generalized Sylvester-type matrix equations. The internal design of the library, Fortran interfaces and implementation issues are discussed in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006